User navigation in a target portal

ABSTRACT

User navigation in a target portal with at least two portal pages. At least one query is created that includes uniform resource locators (URLs) of selected portal pages as search terms in a first search level; repeating until a certain abort criterion is reached: Receiving and analyzing search results of the at least one query including external websites containing search terms as part of their content; selecting a set of uniform resource locators from the received search results; creating a node in a graph-like-model for each selected URL if not already contained in the graph-like-model and associating the node with the selected uniform resource locator; creating and issuing a further search query including selected uniform resource locators of external websites in an additional search level; and in case the certain abort criterion is reached, performing a number of actions.

PRIOR FOREIGN APPLICATION

This application claims priority from the United Kingdom patentapplication number 1419728.9, filed Nov. 5, 2014, which is herebyincorporated herein by reference in its entirety.

BACKGROUND

One or more aspects relate in general to the field of internet portals,and in particular, to user navigation in a target portal.

There are various techniques to automatically adapt a portal to userbehavior, e.g. navigation behavior, as well as administrator behavior,such as portal model changes, user context or according to a semanticanalysis of portal content.

SUMMARY

Shortcomings of the prior art are overcome and additional advantages areprovided through the provision of a method of user navigation in atarget portal with at least two portal pages. The method includes, forinstance, creating at least one query including at least one of uniformresource locators of selected portal pages or content of selected portalpages as search terms in a first search level; repeating until a certainabort criterion is reached: receiving and analyzing search results ofthe at least one query including external websites containing searchterms as part of their content; selecting a set of uniform resourcelocators from the received search results; creating a node in agraph-like-model for each uniform resource locator of the selected setof uniform resource locators, based on the node not already beingcontained in the graph-like-model and associating the node with theuniform resource locator; creating and issuing a further search queryincluding selected uniform resource locators of external websites in anadditional search level; based on reaching the certain abort criterionperforming: computing the graph-like-model containing nodes and edgesrepresenting direct or indirect references between the external websitesand portal pages of the target portal based on the created nodes;defining a threshold value for a maximum distance for pairs of portalpages in the graph-like-model; calculating distances in saidgraph-like-model for the pairs of portal pages of the target portal;comparing the calculated distances for the pairs of portal pages withthe defined threshold value; creating an additional navigation path forpairs of portal pages whose distance is smaller than the thresholdvalue; and displaying the additional navigation path in the targetportal.

Computer program products and systems relating to one or more aspectsare also described and claimed herein.

Additional features and advantages are realized through the techniquesdescribed herein. Other embodiments and aspects are described in detailherein and are considered a part of the claimed aspects.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the present invention, as described in detail below, areshown in the drawings, in which:

FIG. 1 is a schematic block diagram of a web structure including atarget portal, in accordance with an embodiment of the presentinvention;

FIG. 2 is a schematic block diagram of a link structure between variousexternal web sites, i.e. non-portal web sites, and the target portal;

FIGS. 3 and 4 are together a schematic flow diagram of a method for usernavigation in a target portal, in accordance with an embodiment of thepresent invention;

FIG. 5 is a schematic flow diagram of a process for computing agraph-like-model used by the method for user navigation in a targetportal of FIGS. 3 and 4, in accordance with an embodiment of the presentinvention;

FIG. 6 is a schematic flow diagram of a process for defining apage-specific threshold used by the method for user navigation in atarget portal of FIGS. 3 and 4, in accordance with an embodiment of thepresent invention;

FIG. 7 is a schematic flow diagram of a process for defining a user- andpage-specific threshold used by the method for user navigation in atarget portal of FIGS. 3 and 4, in accordance with an embodiment of thepresent invention;

FIG. 8 is a schematic flow diagram of a process for calculatingdistances in the graph-like-model for pairs of pages of the targetportal used by the method for user navigation in a target portal ofFIGS. 3 and 4, in accordance with an embodiment of the presentinvention;

FIGS. 9 to 14 are different states of the graph-like-model during thecreating process of the graph-like-model according to FIGS. 1 and 3, inaccordance with an embodiment of the present invention; and

FIG. 15 is a schematic diagram of the graph-like-model, in accordancewith an embodiment of the present invention.

DETAILED DESCRIPTION

Although there are techniques to adapt a portal to user behavior, thereis no technique to adapt and enhance the portal user experience by usingthe knowledge that is implicitly contained in the hyperlink structurebetween external websites, i.e. non-portal web sites, and pages of atarget portal.

In an example scenario, a service provider offers, e.g. ordering, orderapproval, as well as expense management functionality for clientsthrough a portal. An experienced user of these services provides theuser's knowledge about the various tasks and procedures in a blog or awebsite, including links to the portal pages that contain the portletsthat are relevant for the separate sub-tasks. Other users find thisinformation helpful and comment and/or follow via Twitter, blogs etc.But the user is not able to provide the expertise directly in theportal, since the user is not employed by the service provider.

In a hyperlink structure between various external web pages and aportal, multiple links are pointing to different portal pages. Thebeholder of the hyperlink structure may recognize that the hyperlinkstructure between the external web sites and the portal pages representsvaluable knowledge, e.g. about the portal pages that are related inorder to perform a certain task. Currently the information from theexpert user website is helpful only for those portal users that arelucky enough to find the document. Users who do not find the document donot benefit from the information. In the portal navigation, the portalpages are not located nearby, and there are no clearly evidentnavigation paths between these pages, which make it hard for users tofind the resources for completing their task. In other words, the portalcurrently is not optimally designed for these users.

Therefore, in accordance with one or more aspects of the presentinvention, a method for user navigation in a target portal and acorresponding facility for user navigation in a target portal areprovided, which are able to improve user experience with internetportals and to simplify navigation within the target portal.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

FIG. 1 shows an embodiment of a web structure 1 including a web 3 withvarious web sites W1, W2, W3, W4, a web search engine 5 and a targetportal 10, in accordance with an embodiment of the present invention;and FIG. 2 shows a link structure 7 of the web structure 1 of FIG. 1between the various external websites W1, W2, W3, W4 and the targetportal 10.

Referring to FIGS. 1 and 2, the shown embodiment of the presentinvention employs a facility for user navigation in target portal 10with at least two portal pages 12, 14, 16 comprising a navigationcomponent 100 with an external content and link analysis component 110.The navigation component 100 with the external content and link analysiscomponent 110 automatically finds and analyzes relevant extern websitesW1, W2, W3, W4, i.e. non-portal websites, and adapts a portal navigationaccording to the results of the analysis. Therefore, the navigationcomponent 100 with the external content and link analysis component 110performs a method for user navigation in a target portal, in accordancewith an embodiment of the present invention.

The navigation component 100 performs, e.g., creating at least one queryincluding uniform resource locators (URLs) of selected portal pages 12,14, 16, referenced by links L1, L2, L3, for example, and/or content ofselected portal pages 12, 14, 16 as search terms in a first searchlevel; and issuing the at least one query to at least one web searchengine 5. The content of selected portal pages 12, 14, 16 in the atleast one search term comprises page titles, sub-titles and/or keywords,for example. The navigation component 100 repeats the following until acertain abort criterion is reached: Receiving and analyzing searchresults including external websites W1, W2, W3, W4 containing searchterms as part of their content; selecting a set of uniform resourcelocators (URLs) from a returned search result; creating a node A, B, C,D in a graph-like-model 9, shown in FIGS. 9 to 15, for each selecteduniform resource locators (URLs) if not already contained in thegraph-like-model 9 and associating the node A, B, C, D with the selecteduniform resource locator (URL); creating and issuing a new search queryincluding selected uniform resource locators (URLs) of external websitesW1, W2, W3, W4 in an additional search level. In case the certain abortcriterion is reached, the navigation component 100 performs thefollowing: Computing the graph-like-model 9 containing nodes A, B, C, Dand edges E1 to E6 representing direct or indirect references betweenthe external websites W1, W2, W3, W4 and portal pages 12, 14, 16 of thetarget portal 10 based on the created nodes A, B, C, D; defining athreshold value for a maximum distance between pairs of portal pages 12,14, 16 in the graph-like-model 9; calculating distances in thegraph-like-model 9 between the pairs of portal pages 12, 14, 16 of thetarget portal 10; comparing the calculated distance with the definedthreshold value; creating an additional navigation path between pairs ofportal pages 12, 14, 16 whose distance is smaller than the thresholdvalue; and displaying the additional navigation path in the targetportal 10. The navigation component 100 may use a markup parser to parsea markup of a corresponding page W1, W2, W3, W4.

In the shown embodiment, the target portal 10 comprises, beside thenavigation component 100, multiple state of the art components like anaccess control component 20, a content model and application programminginterface (API) 30, a portlet container 40, a portal database 50, anavigation model and application programming interface (API) 60, anaggregation component 70, a logging component 80 and a state handlingcomponent 90. The access control component 20 manages the access rightsand controls the access to the portal artifacts, especially to theportal pages 12, 14, 16. The content model and application programminginterface (API) 30 manages the structure and content, e.g. portlets, ofthe portal pages 12, 14, 16. The portlet container 40 executes portletsof the portal pages 12, 14, 16. Portlets are software componentscreating markup fragments and arranged on portal pages 12, 14, 16 tocreate parts of the portal pages 12, 14, 16. The portal database 50holds portal data. The navigation model and application programminginterface (API) 60 manages data concerning navigation paths inside thetarget portal 10. The aggregation component 70 renders the portal pages12, 14, 16, wherein markup fragments of the different portlets of acorresponding portal page 12, 14, 16 are aggregated and additionalmarkups like navigation paths, menus, titles etc. are created. Thelogging component 80 stores user actions in the portal. The statehandling component 90 manages different states of the target portal 10.The functioning and modes of operating these state of the art componentsare well known to a skilled person, so a detailed description of thesecomponents is omitted.

Referring to FIG. 2, the shown example simple hyperlink structure 7between four external web pages W1, W2, W3, W4, i.e. non-portal webpages, and the target portal 10 comprising three portal pages 12, 14, 16displays a first link L1 between a first portal page 12 and a firstextern website W1, a second link L2 between a second portal page 14 andthe first extern website W1, a third link L3 between a third portal page16 and a second extern website W2, a fourth link L4 between the firstextern website W1 and a third extern website W3, a fifth link L5 betweenthe third extern website W3 and a fourth extern website W4, and a sixthlink L6 between the second extern website W2 and the fourth externwebsite W4.

FIGS. 3 and 4 show together one example of a method for user navigationin a target portal, in accordance with an embodiment of the presentinvention; FIG. 5 shows a process for computing a graph-like-model 9used by the method for user navigation in a target portal of FIGS. 3 and4; FIG. 6 shows a process for defining a page-specific threshold used bythe method for user navigation in a target portal of FIGS. 3 and 4; FIG.7 shows a schematic flow diagram of a process for defining a user- andpage-specific threshold used by the method for user navigation in atarget portal of FIGS. 3 and 4; and FIG. 8 shows a process forcalculating distances in the graph-like-model 9 for pairs of pages 12,14, 16 of the target portal 10 used by the method for user navigation ina target portal of FIGS. 3 and 4.

FIGS. 9 to 14 show different states of the graph-like-model 9 during thecreating process, and FIG. 15 shows the final state of thegraph-like-model 9.

Referring to FIGS. 3 to 8, in step S100 the navigation component 100creates at least one query including uniform resource locators (URLs) ofselected portal pages 12, 14, 16 and/or content of selected portal pages12, 14, 16 as search terms in a first search level. For the hyperlinkstructure 7 of FIG. 2, the navigation component 100 would create in thefirst search level search queries for each of the three portal pages 12,14, 16.

In step S110 the navigation component 100 issues the at least one queryto the web search engine 5. The web search engine 5 executes the atleast one search query and returns a set of uniform resource locators(URLs) of extern web pages W1, W2, W3, W4 that contain the search termsas part of the page content. In step S120 the navigation component 100receives and analyzes search results of the at least one query includingexternal websites W1, W2, W3, W4 containing search terms as part oftheir content. For the hyperlink structure 7 of FIG. 2, the navigationcomponent 100 would receive uniform resource locators (URLs) of thefirst and second extern web page W1 and W2 in the first search level.

In step S130 the navigation component 100 selects a set of uniformresource locators (URLs) from the received search results. For thehyperlink structure 7 of FIG. 2, the navigation component 100 wouldselect the uniform resource locators (URLs) of the first and secondexternal websites W1, W2.

In step S140 the navigation component 100 creates a node A, B, C, D inthe graph-like-model 9 for each selected uniform resource locator (URL)if not already contained in the graph-like-model 9 and associates thenode A, B, C, D with the selected uniform resource locator (URL). Forthe hyperlink structure 7 of FIG. 2, the navigation component 100 wouldcreate a first node A associated to the uniform resource locator (URL)of the first extern web page W1 and a second node B associated to theuniform resource locator (URL) of the second extern web page W2 in thegraph-like-model 9, as shown in FIG. 9, displaying a first state S1 ofthe creating process of the graph-like-model 9.

In step S150 the navigation component 100 checks if the abort criterionis reached. If the abort criterion is not reached, the navigationcomponent 100 continues with step S160. In step S160 the navigationcomponent 100 creates a further search query including selected uniformresource locators (URLs) of the external websites W1, W2, W3, W4 in anadditional search level. The navigation component 100 repeats steps S110to S150 and issues the query to the web search engine 5 in step S110.The certain abort criterion is defined by a maximum number of nodes A,B, C, D in the graph-like-model 9 and/or a maximum number of processedsearch levels, for example.

For the hyperlink structure 7 of FIG. 2, the navigation component 100continues with a second search level and creates in step S160 a furthersearch query including selected uniform resource locators (URLs) of theexternal websites W1, W2. The navigation component 100 repeats stepsS110 to S150 and issues the query to the web search engine 5 in stepS110. In step S120 the navigation component 100 would receive uniformresource locators (URLs) of the third and fourth extern web page W3 andW4 in the second search level. In step S130 the navigation component 100would select the uniform resource locator (URLs) of the third and fourthexternal website W3, W4. In step S140 the navigation component 100 wouldcreate a third node C associated to the uniform resource locator (URL)of the third extern web page W3 and a fourth node D associated to theuniform resource locator (URL) of the fourth extern web page W4 in thegraph-like-model 9, as shown in FIG. 10, displaying a second state S2 ofthe creating process of the graph-like-model 9. In step S150 thenavigation component 100 checks again if the abort criterion is reached.Since the abort criterion is not reached, the navigation component 100continues with step S160 and creates a further search query includingselected uniform resource locators (URLs) of the external website W3 inan additional search level. The navigation component 100 repeats stepsS110 to S150 and issues the query to the web search engine 5 in stepS110. In step S120 the navigation component 100 would receive uniformresource locator (URL) of the fourth extern web page W4 in the thirdsearch level. In step S130 the navigation component 100 would select theuniform resource locator (URL) of the fourth external website W4. Instep S140 the navigation component 100 would create no new node, sincethe fourth node D in the graph-like-model 9 is already representingwebsite W4. This third state S3 of the creating process of thegraph-like-model 9 is shown in FIG. 11. In step S150 the navigationcomponent 100 checks again if the abort criterion is reached. Since theabort criterion of three search levels, for example, is now reached, thenavigation component 100 continues with step S200.

In step S200 navigation component 100 computes the graph-like-model 9containing nodes A, B, C, D, P1, P2, P3 and edges E1 to E6 representingdirect or indirect references between the external websites W1, W2, W3,W4 and portal pages 12, 14, 16 of the target portal 10 based on thecreated nodes A, B, C, D. In step S210 the navigation component 100defines a threshold value for a maximum distance for pairs of portalpages 12, 14, 16 in the graph-like-model 9. In step S220 the navigationcomponent 100 calculates distances in the graph-like-model 9 for thepairs of portal pages 12, 14, 16 of the target portal 10 and in stepS230 the navigation component 100 compares the calculated distances forthe pairs of portal pages 12, 14, 16 with the defined threshold value.In step S240 the navigation component 100 creates an additionalnavigation path for pairs of portal pages 12, 14, 16 whose distance issmaller than the threshold value; and in step S250 displays theadditional navigation path in the target portal 10.

Referring to FIG. 5, the navigation component 100 starts the computingof the graph-like-model 9 in the shown embodiment in step S300. In stepS310 the external content and link analysis component 110 of thenavigation component 100 requests for each node A, B, C, D in thegraph-like-model 9 a page represented from the node A, B, C, D from theextern website W1, W2, W3, W4 according to a uniform resource locatorURL that is associated with the node A, B, C, D. In step S320 theexternal content and link analysis component 110 parses a markup of acorresponding page and identifies links contained in the page markup. Insteps S330, S340 and S350 the external content and link analysiscomponent 110 checks a corresponding reference for each identified link.In case the link references a page 12, 14, 16 of the target portal 10step S340 goes to step S360 and a corresponding node P1, P2, P3 iscreated in the graph-like-model 9 in step S360 and in step S370 an edgeE1 to E3 is created between an actual node A, B, C, D and the node P1,P2, P3 the link L1 to L3 references to. In case the link references nopage 12, 14, 16 of the target portal 10, step S340 goes to step S350. Instep S350 the external content and link analysis component 110 checks ifthe link references one of the nodes A, B, C, D in the graph-like-model9. If the link references no node A, B, C, D in the graph-like-model 9,the external content and link analysis component 110 gets the next linkin step S365. In case the link L4 to L6 references a node A, B, C, D ofthe graph-like-model 9, an edge E4 to E6 is created between an actualnode A, B, C, D and the node A, B, C, D the link L1 to L3 references to,in step S370. If not all links L1 to L6 are checked, step S375 branchesto step S365 which gets the next link L1 to L6. If all links L1 to L6are checked it is checked in step S380 if all nodes A, B, C, D areprocessed. If not all nodes A, B, C, D of the graph-like-model 9 areprocessed, step S380 branches to step S385 which gets the next node A,B, C, D. If all nodes A, B, C, D are processed, the graph-like-model 9is outputted in step S390.

For the hyperlink structure 7 of FIG. 2, the external content and linkanalysis component 110 processes the first node A representing the firstexternal website W1 according to steps S310 and S320. Since theidentified first link L1 of the first external website W1 references thefirst portal page 12, a fifth node P1 is created in the graph-like-model9 in step S350, and a corresponding first edge E1 between the first nodeA and the fifth node P1 is created in step S370. Since the identifiedsecond link L1 of the first external website W1 references the secondportal page 14, a sixth node P2 is created in the graph-like-model 9 instep S350, and a corresponding second edge E1 between the first node Aand the sixth node P2 is created in step S370. FIG. 12 shows a fourthstate S4 of the graph-like-model 9 after processing the first node A.

After processing the first node A, the external content and linkanalysis component 110 processes the second node B representing thesecond external website W2 according to steps S310 and S320. Since theidentified third link L3 of the second external website W2 referencesthe third portal page 16, a seventh node P3 is created in thegraph-like-model 9 in step S350, and a corresponding third edge E3between the second node B and the seventh node P3 is created in stepS370. FIG. 13 shows a fifth state S5 of the graph-like-model 9 afterprocessing the second node B.

After processing the second node B, the external content and linkanalysis component 110 processes the third node C representing the thirdexternal website W3 according to steps S310 and S320. Since theidentified fourth link L4 of the third external website W3 referencesthe first external website W1 a corresponding fourth edge E4 between thethird node C and the first node A is created in step S370. FIG. 14 showsa sixth state S6 of the graph-like-model 9 after processing the thirdnode C.

After processing the third node C, the external content and linkanalysis component 110 processes the fourth node D representing thefourth external website W4 according to steps S310 and S320. Since theidentified fifth link L5 of the fourth external website W4 referencesthe third external website W3 a corresponding fifth edge E5 between thefourth node D and the third node C is created in step S370. Since theidentified sixth link L6 of the fourth external website W4 referencesthe second external website W2 a corresponding sixth edge E6 between thefourth node D and the second node B is created in step S370. FIG. 15shows a final state of the graph-like-model 9 after processing thefourth node D.

Referring to FIG. 6, the navigation component 100 starts the defining ofa page-specific threshold in the shown embodiment in step S400. In stepS410 a page weight is determined by calculating a usage statistics forthe pages 12, 14, 16 of the target portal 10. In step S420 thepage-specific threshold is defined as a function of the page weight. Instep S430 the page-specific threshold is outputted.

Alternatively to the page-specific threshold, the navigation component100 can define a user- and page-specific threshold as shown in FIG. 7.Referring to FIG. 7, the navigation component 100 starts the defining ofthe user- and page-specific threshold in step S500. In step S510 a pageweight is determined by calculating a usage statistics for the portalpages 12, 14, 16 of the target portal 10 for a specific user or usergroup. In step S520 the user- and page-specific threshold is defined asa function of the page weight. In step S530 a weight table is createdgiving each page 12, 14, 16 of the target portal 10 a user or user groupspecific weight, wherein each weight is associated with either a singleuser or a specific group of users. The page-specific threshold isoutputted in step S540.

Referring to FIG. 8, the external content and link analysis component110 of navigation component 100 starts the calculating of distances inthe graph-like-model 9 for pairs of pages 12, 14, 16 of the targetportal 10 in the shown embodiment in step S600. In step S610 thegraph-like-model 9 shown in FIG. 15 is analyzed to create a distancematrix containing all nodes A, B, C, D, P1, P2, P3 of thegraph-like-model 9, as shown below. The distance matrix gives thedistances for pairs of nodes in the graph-like-model 9. In step S620 theexternal content and link analysis component 110 uses, e.g., a prior artJohnson's algorithm or a prior art Floyd-Warshall algorithm to calculatethe distance matrix for the graph-like-model 9, for example. Thedistance matrix gives the distance counted in the number of edges in theshortest path between pairs of nodes in the graph-like-model 9.

P1 P2 P3 A B C D P1 — 2 5 1 4 2 3 P2 2 — 5 1 4 2 3 P3 5 5 — 4 1 3 2 A 11 4 — 3 1 1 B 4 4 1 3 — 2 1 C 2 2 3 1 2 — 1 D 3 3 2 1 1 1 —

Distance Matrix

The distances in the distance matrix are read out for pairs of nodes P1,P2, P3 representing pages 12, 14, 16 of the target portal 1 in step S630and outputted in step S640. Referring to the distance matrix above forthe nodes P1 and P2 a distance of 2 can be read out. For the nodes P1and P3 a distance of 5 can be read out. For the nodes P2 and P3 adistance of 5 can be read out. If the threshold is set to a maximumdistance of 3, for example, an additional navigation path is implementedonly between the first portal page 12 and the second portal page 14,since the distance between the fifth and sixth node P1, P2 is below thethreshold of 3. The distance between the fifth and seventh node P1 andP3 and the distance between the sixth and seventh node P2 and P3 areabove the threshold, so no additional navigation paths are implementedbetween the first and third portal page 12, 16 and between the secondand third portal page 24, 26.

In one or more aspects, the navigation component 100 automatically findsand analyzes relevant external web pages W1, W2, W3, W4 and adapts theportal navigation according to the results of the analysis. Thenavigation component 100 computes the graph-like-model 9 whose nodes A,B, C, D, P1, P2, P3 represent either a portal page 12, 14, 16 or anexternal web page W1, W2, W3, W4 and whose edges E1 to E6 representreferences between pages. In other words this graph-like-model 9represents direct and indirect references between portal pages 12, 14,16 and external web pages W1, W2, W3, W4.

For each pair of portal pages 12, 14, 16 in the distance matrix, thenavigation component 100 determines if the distance lies below a definedthreshold value. If this is the case, it determines if there alreadyexists a navigation path between this pair of portal pages 12, 14, 16.If this is not the case it creates a new navigation path between thispair of portal pages 12, 14. To dos so, it invokes a navigation modeland application programming interface (API) 60 to update the portalnavigation. The new navigation path is stored as part of the updatedportal navigation model in the portal database 50. During subsequentpage rendering, the portal 10 renders the updated portal navigation aspart of the page 12, 14.

In further embodiments, the navigation component 100 calculates a metricfor the popularity of a portal page 12, 14, 16 by counting the number ofportal requests for this particular page 12, 14, 16. It then uses thismetric as a weighting factor in some of the aspects described above. Itstores the popularity metric in a weight table, giving each portal page12, 14, 16 a weight.

In a further embodiment, the external content and link analysiscomponent 110 of the navigation component 100 uses the page weight toselect the uniform resource locators (URLs) of the target portal 10 instep S100, for example. The external content and link analysis component110 selects those uniform resource locators (URLs) of the portal pages12, 14, 16 whose weight lies above a defined threshold.

In another embodiment, the navigation component 100 uses the page weightin step S240 to determine if a new portal navigation path should becreated. The navigation component 100 calculates a weight dependentthreshold, i.e. the higher the aggregated weight of the portal pages 12,14, 16, the higher the threshold, and then creates the navigation pathif the distance of the pair of portal pages 12, 14, 16 lies below thisthreshold.

In another embodiment, the external content and link analysis component110 of the navigation component 100 calculates a user or user groupspecific popularity metric of a portal page 12, 14, 16, by counting thenumber of portal requests for this particular page 12, 14, 16 for aspecific user or a user group. It stores the popularity metric in aweight table, giving each portal page a user or user group specificweight, i.e., a portal page 12, 14, 16 is assigned a set of multipleweights, where each weight is associated with either a single user or aspecific group of users.

This allows performing user specific portal navigation improvement,i.e., the navigation paths are created specifically for a user or agroup of users. In step S240, the external content and link analysiscomponent 110 of the navigation component 100 calculates a user specificweight dependent threshold and then creates the navigation path if thedistance of the pair of Portal pages lies below this threshold. It thenassociates this navigation path with the user. During page rendering theportal 10 creates a markup for e.g., this navigation path only for theuser associated with the navigation path.

In further embodiment, the navigation paths are created dynamically,e.g. during page rendering for the current portal request, for selecteduser groups, depending on portal state, on the referring web site, userbehavior like e.g. the user's portal navigation history. In anotherembodiment, this navigation component 100 runs on a certain schedule toe.g. update the portal navigation once a day or once a week.

As described herein, a method for user navigation in a target portal anda corresponding facility for user navigation in a target portal areprovided, which are able to improve user experience with internetportals and to simplify navigation within the target portal.

In an embodiment of the present invention, a method for user navigationin a target portal with at least two portal pages comprises: Creating atleast one query including uniform resource locators (URLs) of selectedportal pages and/or content of selected portal pages as search terms ina first search level, repeating the following steps until a certainabort criterion is reached: Receiving and analyzing search results ofthe at least one query including external websites, i.e. non-portal websites, containing search terms as part of their content; selecting a setof uniform resource locators (URLs) from the received search results;creating a node in a graph-like-model for each selected uniform resourcelocator (URLs) if not already contained in the graph-like-model andassociating the node with the selected uniform resource locator (URL);creating and issuing a further search query including selected uniformresource locators (URLs) of external websites in an additional searchlevel.

In case the certain abort criterion is reached the following areperformed: Computing the graph-like-model containing nodes and edgesrepresenting direct or indirect references between the external websitesand portal pages of the target portal based on the created nodes;defining a threshold value for a maximum distance for pairs of portalpages in the graph-like-model; calculating distances in thegraph-like-model for the pairs of portal pages of the target portal;comparing the calculated distances for the pairs of portal pages withthe defined threshold value; creating an additional navigation path forpairs of portal pages whose distance is smaller than the thresholdvalue; and displaying the additional navigation path in the targetportal.

In further embodiments of the present invention, the certain abortcriterion is defined by at least one of the following thresholds:Maximum number of nodes in the graph-like-model, and maximum number ofprocessed search levels.

In further embodiments of the present invention, the content of selectedportal pages in the at least one search term comprises one of thefollowing: Page title, sub-title or keyword.

In further embodiments of the present invention, the following areperformed to compute the graph-like-model: For each node in thegraph-like-model, request a page represented from the node from theextern website according to the uniform resource locator (URL) that isassociated with the node, parse a markup of a corresponding page, andidentify links contained in the page markup.

In further embodiments of the present invention, a correspondingreference for each identified link is checked.

In further embodiments of the present invention, in case the linkreferences a page of the target portal, a corresponding node is createdin the graph-like-model and an edge is created between an actual nodeand the node the link references to.

In further embodiments of the present invention, in case the linkreferences a node in the graph-like-model, an edge is created between anactual node and the node the link references to.

In further embodiments of the present invention, based on thegraph-like-model, a distance matrix is created containing all nodes ofthe graph-like-model, wherein the distance matrix gives the distance forpairs of nodes in the graph-like-model.

In further embodiments of the present invention, the distance matrix iscreated by determining the distances for the pairs of nodes in thegraph-like-model by counting a number of edges along a shortest pathbetween two nodes of a corresponding pair of nodes.

In further embodiments of the present invention, page weights aredetermined by calculating usage statistics for pages of the targetportal, and a page-specific threshold value is defined as a function ofa corresponding page weight.

In further embodiments of the present invention, page weights aredetermined by calculating usage statistics for pages of the targetportal and for a specific user or user group, and page- anduser-specific threshold values are defined as a function ofcorresponding page weights.

In another embodiment of the present invention, a facility for usernavigation in a target portal with at least two portal pages comprises anavigation component with an external content and a link analysiscomponent for performing the method for user navigation in a targetportal. The navigation component performs: Creating at least one queryincluding uniform resource locators (URLs) of selected portal pagesand/or content of selected portal pages as search terms in a firstsearch level; and issuing the at least one query to at least one websearch engine. The navigation component repeats the following until acertain abort criterion is reached: Receiving and analyzing searchresults including external websites containing search terms as part oftheir content; selecting a set of uniform resource locators (URLs) froma returned search result; creating a node in a graph-like-model for eachselected uniform resource locator (URLs) if not already contained in thegraph-like-model and associating the node with the selected uniformresource locator (URL); creating and issuing a new search queryincluding selected uniform resource locators (URLs) of external websitesin an additional search level

In case the certain abort criterion is reached the navigation componentperforms the following: Computing the graph-like-model containing nodesand edges representing direct or indirect references between theexternal websites and portal pages of the target portal based on thecreated nodes; defining a threshold value for a maximum distance betweenpairs of portal pages in the graph-like-model; calculating distances inthe graph-like-model between the pairs of portal pages of the targetportal; comparing the calculated distance with the defined thresholdvalue; creating an additional navigation path between pairs of portalpages whose distance is smaller than the threshold value; and displayingthe additional navigation path in the target portal.

In further embodiments of the present invention, the navigationcomponent uses a markup parser to parse a markup of a correspondingpage.

In another embodiment of the present invention, a data processingprogram for execution in a data processing system comprises softwarecode portions for performing a method for user navigation in a targetportal when the program is run on the data processing system.

In yet another embodiment of the present invention, a computer programproduct stored on a computer-usable medium, comprises computer-readableprogram means for causing a computer to perform a method for usernavigation in a target portal when the program is run on the computer.

An idea of the invention is to improve the user experience in a portal,e.g., the navigation within the portal is simplified and the contentstructure of the portal pages is enhanced.

Embodiments of the present invention automatically enhance the portaluser experience by improving navigation based on the analysis ofrelevant, remote (non-portal) content.

To improve the shortcomings and problems of prior art solutions,embodiments of the present invention are automatically enhancing theportal experience, by allowing users to profit from portal knowledgethey are not aware of. Coming back to the example, the users who are notaware of expertise knowledge described on the external web site aresupported by automatically adapted and improved portal navigation.

Embodiments of the present invention allow portals to automatically findrelevant information represented in the link structure and use thisinformation for improving the portal navigation and portal content.Therefore, the target portal is enabled to automatically improve itsuser experience.

Further embodiments of the present invention may add additionalnavigation elements (“shortcuts”) to the target portal for easynavigation between different pages of the target portal.

Embodiments of the present invention may add wizard-like navigation tostep forward and backward between the portal pages. These navigationelements can be highlighted for selected users or depending on theportal state, i.e. depending on a certain signal that indicate relevanceof these pages for the current user.

The above, as well as additional purposes, features, and advantages ofaspects of the present invention are apparent in the detailed writtendescription.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

What is claimed is:
 1. A method of user navigation in a target portalwith at least two portal pages, said method comprising: creating atleast one query including at least one of uniform resource locators ofselected portal pages or content of selected portal pages as searchterms in a first search level; repeating until a certain abort criterionis reached: receiving and analyzing search results of said at least onequery including external websites containing search terms as part oftheir content; selecting a set of uniform resource locators from saidreceived search results; creating a node in a graph-like-model for eachuniform resource locator of said selected set of uniform resourcelocators, based on the node not already being contained in saidgraph-like-model and associating said node with said uniform resourcelocator; creating and issuing a further search query including selecteduniform resource locators of external websites in an additional searchlevel; based on reaching said certain abort criterion performing:computing said graph-like-model containing nodes and edges representingdirect or indirect references between said external websites and portalpages of said target portal based on said created nodes; defining athreshold value for a maximum distance for pairs of portal pages in saidgraph-like-model; calculating distances in said graph-like-model forsaid pairs of portal pages of said target portal; comparing saidcalculated distances for said pairs of portal pages with said definedthreshold value; creating an additional navigation path for pairs ofportal pages whose distance is smaller than said threshold value; anddisplaying said additional navigation path in said target portal.
 2. Themethod according to claim 1, wherein said certain abort criterion isdefined by at least one of the following thresholds: a maximum number ofnodes in said graph-like-model, and a maximum number of processed searchlevels.
 3. The method according to claim 1, wherein said content ofselected portal pages in said at least one search term comprises one ofthe following: a page title, sub-title or keyword.
 4. The methodaccording to claim 1, wherein the computing an graph-like-modelcomprises: for each node in said graph-like-model: requesting a pagerepresented from said node from an external website according to auniform resource locator that is associated with said node; parsing amarkup of a corresponding page; and identifying links contained in saidmarkup.
 5. The method according to claim 4, further comprising checkinga corresponding reference for each identified link.
 6. The methodaccording to claim 5, wherein based on a link referencing a page of saidtarget portal, creating a corresponding node in said graph-like-modeland an edge between an actual node and the node said link references. 7.The method according to claim 5, wherein based on a link referencing anode in said graph-like-model, creating an edge between an actual nodeand the node said link references.
 8. The method according to claim 1,wherein based on said graph-like-model, creating a distance matrixcontaining nodes of said graph-like-model, wherein said distance matrixgives said distances for pairs of nodes in said graph-like-model.
 9. Themethod according to claim 8, wherein said distance matrix is created bydetermining the distances for said pairs of nodes in saidgraph-like-model by counting a number of edges along a shortest pathbetween two nodes of a corresponding pair of nodes.
 10. The methodaccording to claim 1, further comprising: determining page weights bycalculating usage statistics for pages of said target portal; anddefining a page-specific threshold value as a function of acorresponding page weight.
 11. The method according to claim 1, furthercomprising: determining page weights by calculating usage statistics forpages of said target portal and for a specific user or user group; anddefining page- and user-specific threshold values as a function ofcorresponding page weights.
 12. A computer system for user navigation ina target portal with at least two portal pages, said computer systemcomprising: a memory; and a processor in communication with the memory,wherein the computer system is configured to perform a method, saidmethod comprising: creating at least one query including at least one ofuniform resource locators of selected portal pages or content ofselected portal pages as search terms in a first search level; repeatinguntil a certain abort criterion is reached: receiving and analyzingsearch results of said at least one query including external websitescontaining search terms as part of their content; selecting a set ofuniform resource locators from said received search results; creating anode in a graph-like-model for each uniform resource locator of saidselected set of uniform resource locators, based on the node not alreadybeing contained in said graph-like-model and associating said node withsaid uniform resource locator; creating and issuing a further searchquery including selected uniform resource locators of external websitesin an additional search level; based on reaching said certain abortcriterion performing: computing said graph-like-model containing nodesand edges representing direct or indirect references between saidexternal websites and portal pages of said target portal based on saidcreated nodes; defining a threshold value for a maximum distance forpairs of portal pages in said graph-like-model; calculating distances insaid graph-like-model for said pairs of portal pages of said targetportal; comparing said calculated distances for said pairs of portalpages with said defined threshold value; creating an additionalnavigation path for pairs of portal pages whose distance is smaller thansaid threshold value; and displaying said additional navigation path insaid target portal.
 13. The computer system according to claim 12,wherein the computing said graph-like-model comprises: for each node insaid graph-like-model: requesting a page represented from said node froman external website according to a uniform resource locator that isassociated with said node; parsing a markup of a corresponding page; andidentifying links contained in said markup.
 14. The computer systemaccording to claim 13, wherein the method further comprises checking acorresponding reference for each identified link, and wherein based on alink referencing a page of said target portal, creating a correspondingnode in said graph-like-model and an edge between an actual node and thenode said link references.
 15. The computer system according to claim12, wherein based on said graph-like-model, creating a distance matrixcontaining nodes of said graph-like-model, wherein said distance matrixgives said distances for pairs of nodes in said graph-like-model.
 16. Acomputer program product for user navigation in a target portal with atleast two portal pages, said computer program product comprising: anon-transitory computer readable storage medium readable by a processingcircuit and storing instructions for execution by the processing circuitfor performing a method comprising: creating at least one queryincluding at least one of uniform resource locators of selected portalpages or content of selected portal pages as search terms in a firstsearch level; repeating until a certain abort criterion is reached:receiving and analyzing search results of said at least one queryincluding external websites containing search terms as part of theircontent; selecting a set of uniform resource locators from said receivedsearch results; creating a node in a graph-like-model for each uniformresource locator of said selected set of uniform resource locators,based on the node not already being contained in said graph-like-modeland associating said node with said uniform resource locator; creatingand issuing a further search query including selected uniform resourcelocators of external web sites in an additional search level; based onreaching said certain abort criterion performing: computing saidgraph-like-model containing nodes and edges representing direct orindirect references between said external websites and portal pages ofsaid target portal based on said created nodes; defining a thresholdvalue for a maximum distance for pairs of portal pages in saidgraph-like-model; calculating distances in said graph-like-model forsaid pairs of portal pages of said target portal; comparing saidcalculated distances for said pairs of portal pages with said definedthreshold value; creating an additional navigation path for pairs ofportal pages whose distance is smaller than said threshold value; anddisplaying said additional navigation path in said target portal. 17.The computer program product according to claim 16, wherein thecomputing said graph-like-model comprises: for each node in saidgraph-like-model: requesting a page represented from said node from anexternal website according to a uniform resource locator that isassociated with said node; parsing a markup of a corresponding page; andidentifying links contained in said markup.
 18. The computer programproduct according to claim 17, wherein the method further compriseschecking a corresponding reference for each identified link, and whereinbased on a link referencing a page of said target portal, creating acorresponding node in said graph-like-model and an edge between anactual node and the node said link references.
 19. The computer programproduct according to claim 16, wherein based on said graph-like-model,creating a distance matrix containing nodes of said graph-like-model,wherein said distance matrix gives said distances for pairs of nodes insaid graph-like-model.
 20. The computer program product according toclaim 16, wherein the method further comprises: determining page weightsby calculating usage statistics for pages of said target portal; anddefining a page-specific threshold value as a function of acorresponding page weight.